Gang Scheduling for Distributed Memory Systems
نویسندگان
چکیده
منابع مشابه
Parallel Virtual Memory for Time Shared Environments
This paper analyses the issues involved in providing virtual distributed shared memory for time-shared parallel machines. We study the performance of two di erent page management policies, namely, static and dynamic page allocation under two widely accepted scheduling policies: Gang scheduling and independent processor scheduling. The performance of each page management policy is studied under ...
متن کاملGang scheduling in heterogenous distributed systems
⎯ This paper presents an algorithm for scheduling parallel applications in large-scale, multiuser, heterogeneous distributed systems. The approach is primarily targeted at systems that harvest idle cycles in general-purpose workstation networks, but is also applicable to clustered computer systems and massively parallel processors. The algorithm handles unequal processor capacities, multiple ar...
متن کاملStochastic Analysis of Gang Scheduling in Parallel and Distributed Systems
Gang scheduling is an approach for resource allocation in parallel and distributed systems that combines time-sharing with space-sharing to ensure a short response time for interactive tasks and high overall system throughput. In this paper, we present queueing theoretic models for a particular gang scheduling system under a workload representative of large-scale engineering and scientiic compu...
متن کاملPaging Tradeoffs in Distributed - Shared - Memory
Massively parallel processors have begun using commodity operating systems that support demand-paged virtual memory. To evaluate the utility of virtual memory, we measured the behavior of seven shared-memory parallel application programs on a simulated distributed-shared-memory machine. Our results (1) connrm the importance of gang CPU scheduling, (2) show that a page-faulting processor should ...
متن کاملPerformance Evaluation of Gang Scheduling for Parallel and Distributed Multiprogramming
In this paper we explore the performance of various aspects of gang scheduling designs. We developed an event-driven simulator of a vanilla gang scheduler that relies on the Distributed Hierarchical Control (DHC) structure. We also developed three variations of the vanilla gang scheduler that rely on a push-down heuristic and on two job-migration schemes to decrease response times by reducing p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004